Texture analysis using Renyi's generalized entropies
نویسندگان
چکیده
We propose a texture analysis method based on Rényi’s generalized entropies. The method aims at identifying texels in regular textures by searching for the smallest window through which the minimum number of different visual patterns is observed when moving the window over a given texture. The results show that any of Rényi’s entropies can be used for texel identification. However, the second order entropy, due to its robust estimation, is the most reliable. The main advantages of the proposed method are its robustness and its flexibility. We illustrate the usefulness and the effectiveness of the method in a texture synthesis application.
منابع مشابه
Modeling the Overalternating Bias with an Asymmetric Entropy Measure
Psychological research has found that human perception of randomness is biased. In particular, people consistently show the overalternating bias: they rate binary sequences of symbols (such as Heads and Tails in coin flipping) with an excess of alternation as more random than prescribed by the normative criteria of Shannon's entropy. Within data mining for medical applications, Marcellin propos...
متن کاملGeneralized Degree-Based Graph Entropies
Inspired by the generalized entropies for graphs, a class of generalized degree-based graph entropies is proposed using the known information-theoretic measures to characterize the structure of complex networks. The new entropies depend on assigning a probability distribution about the degrees to a network. In this paper, some extremal properties of the generalized degree-based graph entropies ...
متن کاملResolution Selection Using Generalized Entropies of Multiresolution Histograms
The performances of many image analysis tasks depend on the image resolution at which they are applied. Traditionally, resolution selection methods rely on spatial derivatives of image intensities. Differential measurements, however, are sensitive to noise and are local. They cannot characterize patterns, such as textures, which are defined over extensive image regions. In this work, we present...
متن کاملMeasures of uncertainty mathematical programming and physics
The first section gives the measure of uncertainty given by Shannon (1948) and the generalizations thereof by Schvitzenberger (1954), Kullback (1959), Renyi (1961,1965), Kapur (1967, 1968), and Rathie (1970). It gives some postulates characterizing Shannon's entropy, Renyi's entropy of order a and our entropy of order a and type P. It also gives some properties of this most general type of entr...
متن کاملA Coding Theorem Characterizing Renyi's Entropy through Variable-to-Fixed Length Codes
We prove a coding theorem for the class of variable-to-fixed length codes and memory less processes using a generalized version of average word length and Rényi’s entropy. Further, a generalized version of Tunstall’s algorithm is introduced and its optimality is proved.
متن کامل